Finite-State Transducers
نویسنده
چکیده
Finite-state transducers play an important role in natural language processing. They provide a model for text and speech, as well as transformations of them. In order to reduce the complexity of their application, deterministic and minimal transducers are required. This essay introduces a particular type of finite-state transducers, subsequential string-to-weight transducers, and presents algorithms for their determinization and minimization that have been proposed by Mehryar Mohri. These algorithms are compared with their classical counterparts for finite-state machines and illustrated by examples.
منابع مشابه
Finite State Transducers with Predicates and Identities
An extension to finite state transducers is presented, in which atomic symbols are replaced by arbitrary predicates over symbols. The extension is motivated by applications in natural language processing (but may be more widely applicable) as well as by the observation that transducers with predicates generally have fewer states and fewer transitions. Although the extension is fairly trivial fo...
متن کاملFlexible Speech Synthesis Using Weighted Finite State Transducers
Flexible Speech Synthesis Using Weighted Finite State Transducers
متن کاملSize of Quantum Finite State Transducers
Sizes of quantum and deterministic finite state transducers are compared in the case when both quantum and deterministic finite state transducers exist. The difference in size may be exponential.
متن کاملQuantum Finite State Transducers
We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their ‘little brothers’, the quantum finite automata, the power of qfst is incomparable to that ...
متن کاملParallel intersection and serial composition of finite state transducers
We describe a linguistically expressive and easy to implement parallel semantics for quasi-deterministic finite state transducers (FSTS) used as acceptors. Algorithms are given for detemain-ing acceptance of pairs of phoneme strings given a parallel suite of such transducers and for constructing the equivalent single transducer by parallel intersection. An algorithm for constructing the serial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007